1315B - Homecoming - CodeForces Solution

#include <bits/stdc++.h>

#define inf 0x3f3f3f3f

using namespace std;

typedef pair<int, int> PII;

const int N = 1e6 + 7;


void solve()
{
    int a,b,p;
    cin>>a>>b>>p;
    string s;
    cin>>s;
    int n = s.size();
    s=" "+s;
    int cnta = 0;
    int cntb = 0;
    int j = n;
    for(int i=n-1;i>=1;i--){
        //cout<<s[i];
        if(s[i]=='B'){
            if(cntb==0){
                if(p>=b){
                    p-=b;
                }else{
                    break;
                }
            }
            cnta = 0;
            j = i;
            cntb++;
        }else{
            if(cnta==0){
                if(p>=a){
                    p-=a;
                }else{
                    break;
                }
            }
            j = i;
            cntb = 0;
            cnta++;
        }
    }
    cout<<j<<'\n';
}

signed main()
{
    std::ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int T = 1;
    cin >> T;
    while (T--)
        solve();
    return 0;
}